- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by C. E. M. Yates
29 found
Order:
- A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
- Some Reasons for Generalizing Recursion Theory.G. Kreisel, R. O. Gandy & C. E. M. Yates - 1975 - Journal of Symbolic Logic 40 (2):230-232.
- Initial segments of the degrees of unsolvability part II: Minimal degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.
- Recursively Enumerable Sets and Retracing Functions.C. E. M. Yates - 1962 - Mathematical Logic Quarterly 8 (3‐4):331-345.
- Recursively Enumerable Sets and Retracing Functions.C. E. M. Yates - 1962 - Mathematical Logic Quarterly 8 (3-4):331-345.
- The Present Theory of Turing Machine Computability.C. E. M. Yates & Hartley Rogers - 1966 - Journal of Symbolic Logic 31 (3):513.
- Recursively Enumerable Degrees and the Degrees Less Than 0.C. E. M. Yates & John N. Crossley - 1970 - Journal of Symbolic Logic 35 (4):589-589.
- Meeting of the association for symbolic logic Manchester 1969.R. O. Gandy & C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (4):598-613.
- European summer meeting of the Association for Symbolic Logic, Manchester, England, 1984.P. Aczel, J. B. Paris, A. J. Wilkie, G. M. Wilmers & C. E. M. Yates - 1986 - Journal of Symbolic Logic 51 (2):480-502.
- Donald A. Martin. On a question of G. E. Sacks. The journal of symbolic logic, vol. 31 , pp. 66–69.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (4):528-529.
- Hartley RogersJr., On universal functions. Proceedings of the American Mathematical Society, vol. 16 , pp. 39–44.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (3):513-513.
- T. G. McLaughlin. Co-immune retraceable sets. Bulletin of the American Mathematical Society, vol. 71 , pp. 523–525.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (1):123.
- T. G. McLaughlin. Some observations on quasicohesive sets. The Michigan mathematical journal, vol. 11 , pp. 83–87.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (2):270.
- On a Question of G. E. Sacks.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (4):528-529.
- Daniel Lacombe. La théorie des fonctions récursives et ses applications. Bulletin de la Société Mathématique de France, vol. 88 , pp. 393–468. [REVIEW]C. E. M. Yates - 1973 - Journal of Symbolic Logic 38 (3):526.
- Dov Tamari. Une contribution aux théories de communication: Machines de Turing et problèmes de mot. Synthese, vol. 9 issue 3 nos. 3–5 , pp. 205–227. [REVIEW]C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (1):139-140.
- Gerald E. Sacks. On a theorem of Lachlan and Martin. Proceedings of the American Mathematical Society, vol. 18 , pp. 140–141. [REVIEW]C. E. M. Yates - 1968 - Journal of Symbolic Logic 32 (4):529.
- Hartley RogersJr., The present theory of Turing machine computability. Journal of the Society for Industrial and Applied Mathematics, vol. 7 , pp. 114–130. [REVIEW]C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (3):513-513.
- G. Kreisel. Some reasons for generalizing recursion theory. Logic colloquium '69, Proceedings of the summer school and colloquium in mathematical logic, Manchester, August 1969, edited by R. O. Gandy and C. E. M. Yates, Studies in logic and the foundations of mathematics, vol. 61, North-Holland Publishing Company, Amsterdam and London1971, pp. 139–198. [REVIEW]C. E. M. Yates - 1975 - Journal of Symbolic Logic 40 (2):230-232.
- K. I. Appel and T. G. McLaughlin. On properties of regressive sets. Transactions of the American Mathematical Society, vol. 115 , pp. 83–93. [REVIEW]C. E. M. Yates - 1969 - Journal of Symbolic Logic 33 (4):621.
- Review: Daniel Lacombe, La Theorie des Fonctions Recursives et ses Applications. [REVIEW]C. E. M. Yates - 1973 - Journal of Symbolic Logic 38 (3):526-526.
- Review: G. Kreisel, R. O. Gandy, C. E. M. Yates, Some Reasons for Generalizing Recursion Theory. [REVIEW]C. E. M. Yates - 1975 - Journal of Symbolic Logic 40 (2):230-232.
- Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
- Review: Hartley Rogers, On Universal Functions. [REVIEW]C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (3):513-513.
- Reviews. Hartley Rogers Jr., Theory of recursive functions and effective computability. McGraw-Hill Book Company, New York, St. Louis, San Francisco, Toronto, London, and Sydney, 1967, xix + 482 pp. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
- Review: K. I. Appel, No Recursively Enumerable Set is the Union of Finitely Many Immune Retraceable Sets. [REVIEW]C. E. M. Yates - 1968 - Journal of Symbolic Logic 33 (4):621-621.
- Review: K. I. Appel, T. G. McLaughlin, On Properties of Regressive Sets. [REVIEW]C. E. M. Yates - 1968 - Journal of Symbolic Logic 33 (4):621-621.
- Review: T. G. McLaughlin, Some Observations on Quasicohesive Sets. [REVIEW]C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (2):270-270.
- Review: T. G. McLaughlin, Co-Immune Retraceable Sets. [REVIEW]C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (1):123-123.Export citation
Bookmark
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-64dd777598-vk9kt uwo